The equilateral small octagon of maximal width
نویسندگان
چکیده
A small polygon is a of unit diameter. The maximal width an equilateral with n = 2 s n=2^s vertices not known when alttext="s greater-than-or-equal-to 3"> ≥ 3 encoding="application/x-tex">s \ge 3 . This paper solves the first open case and finds optimal octagon. Its approximately alttext="3.24"> 3.24 encoding="application/x-tex">3.24% larger than regular octagon: alttext="cosine left-parenthesis pi slash 8 right-parenthesis"> cos / 8 stretchy="false">) encoding="application/x-tex">\cos (\pi /8) In addition, proposes family alttext="n"> encoding="application/x-tex">n -gons, for 4"> 4 encoding="application/x-tex">s\ge 4 , whose widths are within alttext="upper O 1 n 4 Baseline O 1 encoding="application/x-tex">O(1/n^4) width.
منابع مشابه
Maximal Equilateral Sets
A subset of a normed space X is called equilateral if the distance between any two points is the same. Let m(X) be the smallest possible size of an equilateral subset of X maximal with respect to inclusion. We first observe that Petty’s construction of a d-dimensional X of any finite dimension d ≥ 4 with m(X) = 4 can be generalised to show that m(X⊕1 R) = 4 for any X of dimension at least 2 whi...
متن کاملMaximal perimeter, diameter and area of equilateral unit-width convex polygons
The paper answers the three distinct questions of maximizing the perimeter, diameter and area of equilateral unit-width convex polygons. The solution to each of these problems is trivially unbounded when the number of sides is even. We show that when this number is odd, the optimal solution to these three problems is identical, and arbitrarily close to a trapezoid. The paper also considers the ...
متن کاملdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولMaximal width learning of binary functions
This paper concerns learning binary-valued functions defined on IR, and investigates how a particular type of ‘regularity’ of hypotheses can be used to obtain better generalization error bounds. We derive error bounds that depend on the sample width (a notion similar to that of sample margin for real-valued functions). This motivates learning algorithms that seek to maximize sample width.
متن کاملOn the Maximal Width of Empty Lattice Simplices
A k-dimensional lattice simplex σ ⊆ Rd is the convex hull of k + 1 affinely independent integer points. General lattice polytopes are obtained by taking convex hulls of arbitrary finite subsets of Zd . A lattice simplex or polytope is called empty if it intersects the lattice Zd only at its vertices. (Such polytopes are studied also under the names elementary and latticefree.) In dimensions d >...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2022
ISSN: ['1088-6842', '0025-5718']
DOI: https://doi.org/10.1090/mcom/3733